On the Solution of Rough Goal Bi-Level Multi-Objective Linear Programming Problem
نویسندگان
چکیده
This paper proposes a bi-level linear programming problem with linear constraints, in which the linear objective functions are to be maximized with different rough goals, the suggested approach in this paper is mainly based on the iterative goal programming method of Dauer and Krueger to develop the optimal solution of the bi-level decisionmaker, then we uses the concepts of tolerance membership function technique to generate the optimal solution for this problem. An auxiliary problem is discussed as well as an example is presented.
منابع مشابه
TOPSIS approach to linear fractional bi-level MODM problem based on fuzzy goal programming
The objective of this paper is to present a technique for order preference by similarity to ideal solution (TOPSIS) algorithm to linear fractional bi-level multi-objective decision-making problem. TOPSIS is used to yield most appropriate alternative from a finite set of alternatives based upon simultaneous shortest distance from positive ideal solution (PIS) and furthest distance from negative ...
متن کاملIntegrating Goal Programming, Taylor Series, Kuhn-Tucker Conditions, and Penalty Function Approaches to Solve Linear Fractional Bi-level Programming Problems
In this paper, we integrate goal programming (GP), Taylor Series, Kuhn-Tucker conditions and Penalty Function approaches to solve linear fractional bi-level programming (LFBLP)problems. As we know, the Taylor Series is having the property of transforming fractional functions to a polynomial. In the present article by Taylor Series we obtain polynomial objective functions which are equivalent...
متن کاملA bi-level linear programming problem for computing the nadir point in MOLP
Computing the exact ideal and nadir criterion values is a very important subject in multi-objective linear programming (MOLP) problems. In fact, these values define the ideal and nadir points as lower and upper bounds on the nondominated points. Whereas determining the ideal point is an easy work, because it is equivalent to optimize a convex function (linear function) over a con...
متن کاملA bi-level linear multi-objective decision making model with interval coefficients for supply chain coordination
Abstract: Bi-level programming, a tool for modeling decentralized decisions, consists of the objective(s) of the leader at its first level and that is of the follower at the second level. Three level programming results when second level is itself a bi-level programming. By extending this idea it is possible to define multi-level programs with any number of levels. Supply chain planning problem...
متن کاملA BI-LEVEL LINEAR MULTI-OBJECTIVE DECISION MAKING MODEL WITH INTERVAL COEFFICIENTS FOR SUPPLY CHAIN COORDINATION
Bi-level programming, a tool for modeling decentralized decisions, consists of the objective(s) of the leader at its first level and that is of the follower at the second level. Three level programming results when second level is itself a bi-level programming. By extending this idea it is possible to define multi-level programs with any number of levels. Supply chain planning problems are co...
متن کامل